Adherences of D0L languages

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Results Concerning Thinness of D0l Languages

A language L is called thin if there exists an integer n0 such that for all n n0 L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin. TUCS Research Group Mathematical...

متن کامل

The Topological Structure of Adherences of Regular Languages

— The topological structure of the adhérence of a regular language is characterized by afînite invariant structure that can be algorithmically constructed from any automaton recognizing the language. Homeomorphism of the adhérences of regular languages can be decided by constructing and comparing their associated invariant structures. These results are obtained by applying concepts and analyses...

متن کامل

Bispecial factors in circular non-pushy D0L languages

We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent. keywords: bispecial factors, circular D0L systems, non-pushy D0L systems, cri...

متن کامل

On D0L power series

We study D0L power series. We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and integers which can be appear as coe cients in D0L power series and establish various decidability results. TUCS Research Group Mathematical Structures of Computer Science

متن کامل

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1984

ISSN: 0304-3975

DOI: 10.1016/0304-3975(84)90131-2